首页> 外文OA文献 >On duality and fractionality of multicommodity flows in directed networks
【2h】

On duality and fractionality of multicommodity flows in directed networks

机译:关于有向时间多品种流动的二元性和分数性   网络

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。
获取外文期刊封面目录资料

摘要

In this paper we address a topological approach to multiflow (multicommodityflow) problems in directed networks. Given a terminal weight $\mu$, we define ametrized polyhedral complex, called the directed tight span $T_{\mu}$, andprove that the dual of $\mu$-weighted maximum multiflow problem reduces to afacility location problem on $T_{\mu}$. Also, in case where the network isEulerian, it further reduces to a facility location problem on the tropicalpolytope spanned by $\mu$. By utilizing this duality, we establish theclassifications of terminal weights admitting combinatorial min-max relation(i) for every network and (ii) for every Eulerian network. Our result includesLomonosov-Frank theorem for directed free multiflows andIbaraki-Karzanov-Nagamochi's directed multiflow locking theorem as specialcases.
机译:在本文中,我们解决了针对有向网络中的多流(multicommodityflow)问题的拓扑方法。给定终端权重$ \ mu $,我们定义了称为有向紧密跨度$ T _ {\ mu} $的磨光多面体复合体,并证明了加权的\\ mu $的对偶最大多流问题减少为$ T_上的设施位置问题{\ mu} $。而且,在网络是欧拉网络的情况下,它进一步简化为跨$ \ mu $的热带多面体上的设施位置问题。通过利用这种二元性,我们建立了允许组合最小-最大关系的终极权重的分类:(i)每个网络和(ii)每个欧拉网络。我们的结果包括有向自由多流的罗蒙诺索夫-弗兰克定理和特例的茨城-卡尔扎诺夫-纳莫莫的有向多流锁定定理。

著录项

  • 作者

    Hirai, Hiroshi; Koichi, Shungo;

  • 作者单位
  • 年度 2011
  • 总页数
  • 原文格式 PDF
  • 正文语种 {"code":"en","name":"English","id":9}
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号